Improved Approximation of Linear Threshold Functions
نویسندگان
چکیده
منابع مشابه
Approximation Resistance and Linear Threshold Functions
In the boolean Max− k−CSP (f) problem we are given a predicate f : {−1, 1}k → {0, 1}, a set of variables, and local constraints of the form f(x1, ..., xk), where each xi is either a variable or negated variable. The goal is to assign values to variables as to maximize the fraction of constraints which evaluate to 1. Many such problems are NP-Hard to solve exactly, and some are even NPHard to ap...
متن کاملLearning Noisy Linear Threshold Functions
This papers describes and analyzes algorithms for learning linear threshold function (LTFs) in the presence of classiication noise and monotonic noise. When there is classiication noise, each randomly drawn example is mislabeled (i.e., diiers from the target LTF) with the same probability. For monotonic noise, the probability of mis-labeling an example monotonically decreases with the separatio...
متن کاملPolynomial Threshold Functions: Structure, Approximation and Pseudorandomness
We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows that low-degree polynomial threshold functions cannot approximate any function with many influential variables. We provide a couple of examples where this tech...
متن کاملDistribution-Independent Evolvability of Linear Threshold Functions
Valiant’s (2007) model of evolvability models the evolutionary process of acquiring useful functionality as a restricted form of learning from random examples. Linear threshold functions and their various subclasses, such as conjunctions and decision lists, play a fundamental role in learning theory and hence their evolvability has been the primary focus of research on Valiant’s framework (2007...
متن کاملLinear approximation of Bidirectional Reflectance Distribution Functions
Various empirical and theoretical models of the surface reflectance have been introduced so far. Most of these models are based on functions with non-linear parameters and therefore faces some computational difficulties involved in non-linear optimization processes. In this paper, we introduce a new approach for approximating Bidirectional Reflectance Distribution Functions (BRDF) by employing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: computational complexity
سال: 2012
ISSN: 1016-3328,1420-8954
DOI: 10.1007/s00037-012-0045-5